Papers with divide-and-conquer strategy
Implicitly Abusive Language – What does it actually look like and why are we not getting there? (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing datasets make learning implicit abuse difficult, argues a new position paper . a lack of work on implicit abuse has limited the effectiveness of automatic detection . |
| Approach: | They argue that existing datasets make learning implicit abuse difficult . they propose a divide-and-conquer strategy to detect implicit abuse . |
| Outcome: | The proposed model could be improved to detect implicit abuse in a dataset with a standardized model. |
A Mixture-of-Experts Model for Antonym-Synonym Discrimination (2021.acl-short)
Copied to clipboard
| Challenge: | Anatomy-synonymy discrimination (ASD) is a crucial problem in lexical semantics and is difficult to distinguish between antonyms and synonyms. |
| Approach: | They propose a divide-and-conquer strategy where localized experts focus on their own domains to learn their specialties. |
| Outcome: | The proposed method achieves state-of-the-art performance on the Antonymy-synonymy discrimination task. |
MoqaGPT : Zero-Shot Multi-modal Open-domain Question Answering with Large Language Model (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) like GPT-4 are not able to handle multi-modal open-domain question answering in a zero-shot manner. |
| Approach: | MoqaGPT uses divide-and-conquer strategy to extract answers from each modality separately. |
| Outcome: | MoqaGPT improves on MMCoQA dataset by +37.91 points and EM by +34.07 points. |
LPNL: Scalable Link Prediction with Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on graph learning with large language models have focused on the link prediction task on large graphs. |
| Approach: | They propose a framework for scalable link prediction on large-scale heterogeneous graphs based on large language models. |
| Outcome: | The proposed framework outperforms baselines in link prediction tasks on large graphs. |
GRAG: Graph Retrieval-Augmented Generation (2025.findings-naacl)
Copied to clipboard
| Challenge: | Naive Retrieval-Augmented Generation (RAG) focuses on individual documents during retrieval and is not suitable for networked documents. |
| Approach: | They propose a novel divide-and-conquer strategy that retrieves optimal subgraph structure in linear time. |
| Outcome: | The proposed approach outperforms current state-of-the-art methods on graph reasoning benchmarks. |
LoGU: Long-form Generation with Uncertainty Expressions (2025.acl-long)
Copied to clipboard
Ruihan Yang, Caiqi Zhang, Zhisong Zhang, Xinting Huang, Sen Yang, Nigel Collier, Dong Yu, Deqing Yang
| Challenge: | Large Language Models (LLMs) generate factually incorrect content, i.e., hallucinations, despite impressive performance. |
| Approach: | They propose a framework to enable models to express uncertainty when unsure . they propose atomic claims to refine uncertainty and refine it using supervised fine-tuning and direct preference optimization to enhance uncertainty expression. |
| Outcome: | The proposed framework significantly improves accuracy, reduces hallucinations, and maintains comprehensiveness of responses. |
LLM×MapReduce: Simplified Long-Sequence Processing using Large Language Models (2025.acl-long)
Copied to clipboard
Zihan Zhou, Chong Li, Xinyi Chen, Shuo Wang, Yu Chao, Zhili Li, Haoyu Wang, Qi Shi, Zhixing Tan, Xu Han, Xiaodong Shi, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing studies have focused on extending the context length of large language models (LLMs) due to their quadratic computational complexity and a lack of high-quality long training examples, most LLMs are trained with a limited window size. |
| Approach: | They propose a training-free framework that enables large language models to effectively process long texts using a divide-and-conquer strategy for comprehensive document understanding. |
| Outcome: | The proposed framework outperforms open-source and commercial long-context LLMs and is compatible with several models. |